Lecture : Tail Inequalities [sp'''] .. Markov's Inequality
نویسنده
چکیده
Popular tradition may be used to defend what seems irrational, and you can also say that sometimes it is not irrational, for it is likely that unlikely things should happen. — Aristotle, Poetics (c.335 BCE) But, on the other hand, Uncle Abner said that the person that had took a bull by the tail once had learnt sixty or seventy times as much as a person that hadn’t, and said a person that started in to carry a cat home by the tail was gitting knowledge that was always going to be useful to him, and warn’t ever going to grow dim or doubtful. — Mark Twain, Tom Sawyer Abroad (1894)
منابع مشابه
18 . S 096 : Concentration Inequalities , Scalar and Matrix Versions
These are lecture notes not in final form and will be continuously edited and/or corrected (as I am sure it contains many typos). Please let me know if you find any typo/mistake. Also, I am posting short descriptions of these notes (together with the open problems) on my Blog, see [Ban15a]. Concentration and large deviations inequalities are among the most useful tools when understanding the pe...
متن کاملLecture : Tail Inequalities [fa'''] .. Markov's Inequality
The simple recursive structure of skip lists made it relatively easy to derive an upper bound on the expected worst-case search time, by way of a stronger high-probability upper bound on the worst-case search time. We can prove similar results for treaps, but because of the more complex recursive structure, we need slightly more sophisticated probabilistic tools. These tools are usually called ...
متن کامل0368 - 3248 - 01 - Algorithms in Data Mining Fall 2013 Lecture 4 : Home Assignment , Due Dec 3 rd
Warning: This note may contain typos and other inaccuracies which are usually discussed during class. Please do not cite this note as a reliable source. If you find mistakes, please inform me. 1 Probabilistic inequalities setup In this question you will be asked to derive the three most used probabilistic inequalities for a specific random variable. Let x 1 ,. .. , x n be independent {−1, 1} va...
متن کامل.1 Markov's Inequality
We will develop some inequalities which let us bound the probability of a random variable taking a value very far from its expectation. This is the most basic inequality we will use. This is useful if the only thing we know about a random variable is its expectation. It will also be useful to derive other inequalities later.
متن کاملInequalities and Asymptotic Estimates
Unless specified otherwise, we use µ, σ 2 to denote the mean and variance of the the variable under consideration. This note shall be updated throughout the seminar as I find more useful inequalities. 1 Basic inequalities Theorem 1.1 (Markov's Inequality). If X is a random variable taking only non-negative values, then for any a > 0 Pr[X ≥ a] ≤ E[X] a. (1) Proof. We show this for the discrete c...
متن کامل